منابع مشابه
Dynamic Monopolies of Constant Size
This paper deals with a polling game on a graph. Initially, each vertex is colored white or black. At each round, each vertex is colored by the color shared by the majority of vertices in its neighborhood. (All recolorings are done simultaneously). We say that a set W0 of vertices is a dynamic monopoly or dynamo if starting the game with the vertices ofW0 colored white, the entire system is whi...
متن کاملConstant-Size Dynamic k-TAA
k-times anonymous authentication (k-TAA) schemes allow members of a group to be authenticated anonymously by application providers for a bounded number of times. Dynamic k-TAA allows application providers to independently grant or revoke users from their own access group so as to provide better control over their clients. In terms of time and space complexity, existing dynamic k-TAA schemes are...
متن کاملDynamic Monopolies with Stochastic Demand
This paper analyzes Perfect Bayesian Equilibria in dynamic monopolies with stochastic demand. It examines sequential take-it-or-leave-it o®ers and sequential auctions. It is shown that equilibria in the former mechanism trade-o® allocative e±ciency and competing buyers' opportunities to acquire an item to be sold, permitting prices and expected revenue above those of one-shot o®ers and sequenti...
متن کاملDynamic monopolies with randomized starting configuration
Properties of systems with majority voting rules have been exhaustingly studied. In this work we focus on the randomized case where the system is initialized by randomized initial set of seeds. Our main aim is to give an asymptotic estimate for sampling probability, such that the initial set of seeds is (is not) a dynamic monopoly almost surely. After presenting some trivial examples, we presen...
متن کاملOn irreversible dynamic monopolies in general graphs
Consider the following coloring process in a simple directed graph G(V, E) with positive indegrees. Initially, a set S of vertices are white, whereas all the others are black. Thereafter, a black vertex is colored white whenever more than half of its in-neighbors are white. The coloring process ends when no additional vertices can be colored white. If all vertices end up white, we call S an irr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2001
ISSN: 0095-8956
DOI: 10.1006/jctb.2001.2045